Modularity in lambda calculus
نویسنده
چکیده
The variety (equational class) of lambda abstraction algebras was introduced to algebraize the untyped lambda calculus in the same way cylindric and polyadic algebras algebraize the rst-order predicate logic. In this paper we prove that the variety of lambda abstraction algebras is not congruence modular and that the lattice of lambda theories is not modular.
منابع مشابه
Nonmodularity Results for Lambda Calculus
The variety (equational class) of lambda abstraction algebras was introduced to algebraize the untyped lambda calculus in the same way cylindric and polyadic algebras algebraize the first-order predicate logic. In this paper we prove that the lattice of lambda theories is not modular and that the variety generated by the term algebra of a semi-sensible lambda theory is not congruence modular. A...
متن کاملLambda: the ultimate syntax-semantics interface
Spreadsheets in accounting and Matlab in engineering are immensely popular because these glorified calculators let domain experts play : write down a problem in familiar terms and quickly try a number of solutions. Natural-language semanticists have a better tool. Not only does it compute grammar yields and truth values, it also infers types, normalizes terms, and displays truth conditions as f...
متن کاملLambda Calculus,Conservative Extension and Structural Induction
The issue of whether embedding algebraic theories in higher-order theories such as the simply typed and polymorphic lambda calculi is of interest in programming language design. The establishment of such a conservative extension result permits modularity in the verification of the correctness of datatype and function implementations. In earlier work [Breazu-Tannen & Meyer 1987a], [Breazu-Tannen...
متن کاملOn the confluence of λ-calculus with conditional rewriting
The confluence of untyped λ-calculus with unconditional rewriting is now well understood. In this paper, we investigate the confluence of λ-calculus with conditional rewriting and provide general results in two directions. First, when conditional rules are algebraic. This extends results of Müller and Dougherty for unconditional rewriting. Two cases are considered, whether betareduction is allo...
متن کاملOn the Confluence of lambda-Calculus with Conditional Rewriting
The confluence of untyped λ-calculus with unconditional rewriting is now well understood. In this paper, we investigate the confluence of λ-calculus with conditional rewriting and provide general results in two directions. First, when conditional rules are algebraic. This extends results of Müller and Dougherty for unconditional rewriting. Two cases are considered, whether betareduction is allo...
متن کامل